Survey of Quasirandomness in Number Theory
نویسنده
چکیده
In [9], the author introduced quasirandom permutations, permutations of Zn which map intervals to sets with low discrepancy. Here we show that several natural number-theoretic permutations are quasirandom, some very strongly so. Quasirandomness is established via discrete Fourier analysis and the ErdősTurán inequality, as well as by other means. We apply our results on Sós permutations to make progress on a number of questions relating to the sequence of fractional parts of multiples of an irrational. Several intriguing new open problems are presented throughout the discussion.
منابع مشابه
Quasirandomness and Gowers’ Theorem
“Quasirandomness” will be described and the Quasirandomness Theorem will be used to prove Gowers’ Theorem. This article assumes some familiarity with linear algebra and elementary probability theory.
متن کاملAn approximate version of Sidorenko’s conjecture
A beautiful conjecture of Erdős-Simonovits and Sidorenko states that if H is a bipartite graph, then the random graph with edge density p has in expectation asymptotically the minimum number of copies of H over all graphs of the same order and edge density. This conjecture also has an equivalent analytic form and has connections to a broad range of topics, such as matrix theory, Markov chains, ...
متن کاملCounting Cycles to Efficiently Certify Sparse Hypergraph Quasirandomness
One surprising property of Chung, Graham, and Wilson’s characterization of dense quasirandom graphs is a polynomial-time verifiable property Cycle4, which states that the number of copies of the cycle of length four is what one would expect in a random graph of the same density. Targeting problems like random k-SAT, this algorithm has been extended in several ways to sparse quasirandomness by s...
متن کاملThe poset of hypergraph quasirandomness
Chung and Graham began the systematic study of hypergraph quasirandom properties soon after the foundational results of Thomason and Chung-Graham-Wilson on quasirandom graphs. One feature that became apparent in the early work on hypergraph quasirandomness is that properties that are equivalent for graphs are not equivalent for hypergraphs, and thus hypergraphs enjoy a variety of inequivalent q...
متن کاملHamilton cycles in quasirandom hypergraphs
We show that, for a natural notion of quasirandomness in k-uniform hypergraphs, any quasirandom k-uniform hypergraph on n vertices with constant edge density and minimum vertex degree Ω(nk−1) contains a loose Hamilton cycle. We also give a construction to show that a k-uniform hypergraph satisfying these conditions need not contain a Hamilton `-cycle if k − ` divides k. The remaining values of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003